Graph Products and New Solutions to Oberwolfach Problems
نویسندگان
چکیده
We introduce the circle product, a method to construct simple graphs starting from known ones. The circle product can be applied in many different situations and when applied to regular graphs and to their decompositions, a new regular graph is obtained together with a new decomposition. In this paper we show how it can be used to construct infinitely many new solutions to the Oberwolfach problem, in both the classic and the equipartite case.
منابع مشابه
A new approach in graph- based integrated production and distribution scheduling for perishable products
This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated sc...
متن کاملWorkshop: Algorithmic Graph Theory Table of Contents
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms for computationally difficult graph problems. The techniques studied at the workshhop included: the probabilistic method and randomized algorithms, approximation and optimization, structured families of graphs and approximation algorithms for large problems. The worksh...
متن کاملThe Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle components in each 2-factor like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski’s decomposition techniques used to ...
متن کاملTwo-factorizations of Small Complete Graphs Ii: the Case of 13 Vertices
We establish that for each of the 5005 possible types of 2factorizations of the complete graph K13, there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem
متن کاملOn sharply vertex transitive 2-factorizations of the complete graph
We introduce the concept of a 2-starter in a groupG of odd order.We prove that any 2-factorization of the complete graph admitting G as a sharply vertex transitive automorphism group is equivalent to a suitable 2-starter in G. Some classes of 2-starters are studied, with special attention given to those leading to solutions of some Oberwolfach or Hamilton–Waterloo problems. © 2005 Elsevier Inc....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011